FAST PARALLEL PERMUTATION ALGORITHMS

Fast Parallel Permutation Algorithms

We investigate the problem of permuting n data items on an EREW PRAM with p processors using little additional storage We present a simple algorithm with run time O n p logn and an improved algorithm with run time O n p logn log log n p Both algorithms require n additional global bits and O local storage per processor If pre x summation is supported at the instruction level the run time of the ...

Parallel Processing Letters Fast Parallel Permutation Algorithms

We investigate the problem of permuting n data items on an EREW PRAM with p processors using little additional storage. We present a simple algorithm with run time O((n/p)logn) and an improved algorithm with run time O(n/p+logn loglog(n/p)). Both algorithms require n additional global bits and O(1) local storage per processor. If preex summation is supported at the instruction level, the run ti...

Fast search algorithms for layout permutation problems

Engineering Fast Parallel Matching Algorithms

The computation of matchings has applications in the solving process of a large variety of problems, e.g. as part of graph partitioners. We present and analyze three sequential and two parallel approximation algorithms for the cardinality and weighted matching problem. One of the sequential algorithms is based on an algorithm by Karp and Sipser to compute maximal matchings [21]. Another one is ...

MergeShuffle: A Very Fast, Parallel Random Permutation Algorithm

This article introduces an algorithm, MERGESHUFFLE, which is an extremely efficient algorithm to generate random permutations (or to randomly permute an existing array). It is easy to implement, runs in nlog2n + O(1) time, is in-place, uses nlog2n + Θ(n) random bits, and can be parallelized accross any number of processes, in a shared-memory PRAM model. Finally, our preliminary simulations usin...